Iteration of the number-theoretic function f(2n) = n, f(2n + 1) = 3n + 2
نویسندگان
چکیده
منابع مشابه
Computing Isogenies in F2n
Contrary to what happens over prime elds of large characteristic , the main cost when counting the number of points of an elliptic curve E over F2n is the computation of isogenies of prime degreè. The best method so far is due to Couveignes and needs asymptotically O(` 3) eld operations. We outline in this article some nice properties satissed by these isogenies and show how we can get from the...
متن کاملCOUNTING POINTS ON ELLIPTIC CURVES OVER F2n,
In this paper we present an implementation of Schoofs algorithm for computing the number of i"2m-P°mts °f an elliptic curve that is defined over the finite field F2m . We have implemented some heuristic improvements, and give running times for various problem instances.
متن کاملF2N-Rank: Domain Keywords Extraction Algorithm
Domain keywords extraction is very important for information extraction, information retrieval, classification, clustering, topic detection and tracking, and so on. TextRank is a common graph-based algorithm for keywords extraction. For TextRank, only edge weights are taken into account. We proposed a new text ranking formula that takes into account both edge and node weights, named F2N-Rank. E...
متن کاملA Note on a Class of Quadratic Permutations over F2n
1 Finding new classes of permutation polynomials is a chal-lenging problem with applications in cryptography, coding theory andin combinatorial designs [1]. We will here focus on a specific instanceraised by Patarin in his paper introducig HFE [2], namely characterizingquadratic permutation polynomials. After a survey of existing results, wewill present our extension of some...
متن کاملOn the Number of Trace-One Elements in Polynomial Bases for F2n
This paper investigates the number of trace-one elements in a polynomial basis for F2n . A polynomial basis with a small number of trace-one elements is desirable because it results in an efficient and lowcost implementation of the trace function. We focus on the case where the reduction polynomial is a trinomial or a pentanomial, in which case field multiplication can also be efficiently imple...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 1977
ISSN: 0001-8708
DOI: 10.1016/0001-8708(77)90087-1